Size Reduction of Multitape Automata
نویسندگان
چکیده
منابع مشابه
On Minimality and Size Reduction of One-Tape and Multitape Finite Automata
In this thesis, we consider minimality and size reduction issues of one-tape and multitape automata. Although the topic of minimization of one-tape automata has been widely studied for many years, it seems that some issues have not gained attention. One of these issues concerns finding specific conditions on automata that imply their minimality in the class of nondeterministic finite automata (...
متن کاملThe “equal last” predicate for words on infinite alphabets and classes of multitape automata
Along with the usual predicates “prefix” and “equal length”, the predicate “equal last letter” leads to a first order theory of the free infinitely generated monoid whose definable relations are related to the algebra of relations recognized by different types of multitape automata which are natural extensions of the famous Rabin-Scott multitape automata and the so-called synchronous automata. ...
متن کاملDerived-Term Automata of Multitape Rational Expressions
We consider (weighted) rational expressions to denote series over Cartesian products of monoids. We define an operator | to build multitape expressions such as (a | x+ b | y)∗. We introduce expansions, which generalize the concept of derivative of a rational expression, but relieved from the need of a free monoid. We propose an algorithm based on expansions to build multitape automata from mult...
متن کاملThe equivalence problem of multidimensional multitape automata
This article considers the equivalence problem of multitape automata with multidimensional tapes, where the motion of the heads is monotone in all directions (no backward motion). It is shown that this problem can be reduced to the equivalence problem of ordinary multitape automata. Some applications of the result are adduced. © 2008 Elsevier Inc. All rights reserved.
متن کاملThe Equivalence Problem of Multitape Finite Automata
Using a result of B.H. Neumann we extend Eilenberg’s Equality Theorem to a general result which implies that the multiplicity equivalence problem of two (nondeterministic) multitape finite automata is decidable. As a corollary we solve a long standing open problem in automata theory, namely, the equivalence problem for multitape deterministic finite automata. The main theorem states that there ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004